'That'-clauses as existential quantifiers
نویسندگان
چکیده
منابع مشابه
Magic-Sets for Datalog with Existential Quantifiers
Datalog∃ is the extension of Datalog allowing existentially quantified variables in rule heads. This language is highly expressive and enables easy and powerful knowledge-modelling, but the presence of existentially quantified variables makes reasoning over Datalog∃ undecidable in the general case. Restricted classes of Datalog∃, such as Shy, have been proposed in the literature with the aim of...
متن کاملExistential quantifiers in the rule body
In this paper we consider a simple syntactic extension of Answer Set Programming (ASP) for dealing with (nested) existential quantifiers and double negation in the rule bodies, in a close way to the recent proposal RASPL-1. The semantics for this extension just resorts to Equilibrium Logic (or, equivalently, to the General Theory of Stable Models), which provides a logic-programming interpretat...
متن کاملMore on Quantifiers in Comparative Clauses
Goal: To give an explanation of the ban on downward entailing quantifiers (DE-Qs) in comparative clauses (c-clauses, cf. (1)) that is compatible with the solutions to the problem of quantifier 'scope' in c-clauses (cf. [I assume degree predicates are monotonic] (1)*Ann is taller than no/not all/few boys are. (2) Apparent generalization: B is F-er than Q is is true iff Q(λx. B is F-er than x is)...
متن کاملDisjunctive datalog with existential quantifiers: Semantics, decidability, and complexity issues
Datalog is one of the best-known rule-based languages, and extensions of it are used in a wide context of applications. An important Datalog extension is Disjunctive Datalog, which significantly increases the expressivity of the basic language. Disjunctive Datalog is useful in a wide range of applications, ranging from Databases (e.g., Data Integration) to Artificial Intelligence (e.g., diagnos...
متن کاملEfficient Query Answering over Datalog with Existential Quantifiers
This paper faces the problem of answering conjunctive queries over Datalog programs allowing existential quantifiers in rule heads. Such an extension of Datalog is highly expressive, enables easy yet powerful ontology-modelling, but leads to undecidable query answering in general. To overcome undecidability, we first define Shy, a subclass of Datalog with existential quantifiers preserving not ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Analysis
سال: 2004
ISSN: 0003-2638,1467-8284
DOI: 10.1093/analys/64.3.229